Explicit mathematics: power types and overloading
نویسندگان
چکیده
منابع مشابه
Explicit mathematics: power types and overloading
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types using a monotone power type generator. These power types allow us to model impredicative overloading. This is a very general form of type dependent computation which occurs in the study of object-oriented programming lang...
متن کاملImpredicative Overloading in Explicit Mathematics
We introduce the system OTN of explicit mathematics based on elementary separation, products, joins and weak power types. In this theory, we will define late-bound overloaded functions with a corresponding impredicative type structure à la λ&. Then we present a set-theoretic model for OTN which provides a denotational semantics for impredicative overloading without restricting itself to early-b...
متن کاملApplicative Theories and Explicit Mathematics
[5] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [6] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [9] Susumu Hayashi and Satoshi Kobayashi. A new formulation of Feferman's system of functions and classes and its relation to Frege structures.
متن کاملUniverses in explicit mathematics
This paper deals with universes in explicit mathematics. After introducing some basic definitions, the limit axiom and possible ordering principles for universes are discussed. Later, we turn to least universes, strictness and name induction. Special emphasis is put on theories for explicit mathematics with universes which are proof-theoretically equivalent to Feferman’s T0.
متن کاملDependent Types with Subtyping and Late-Bound Overloading
We present a calculus with dependent types, subtyping and late-bound overloading. Besides its theoretical interest this work is motivated by several practical needs that range from the definition of logic encodings, to proof specialization and reuse, and to object-oriented extension of the SML module system. The theoretical study of this calculus is not straightforward. While confluence is rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2005
ISSN: 0168-0072
DOI: 10.1016/j.apal.2004.12.002